On graph problems in a semi-streaming model
نویسندگان
چکیده
منابع مشابه
On Graph Problems in a Semi-streaming Model
We formalize a potentially rich new streaming model, the semi-streaming model, that we believe is necessary for the fruitful study of efficient algorithms for solving problems on massive graphs whose edge sets cannot be stored in memory. In this model, the input graph, G = (V,E), is presented as a stream of edges (in adversarial order), and the storage space of an algorithm is bounded by O(n · ...
متن کاملOn Graph Problems in a Semi-streaming Model
Massive graphs arise naturally in a lot of applications, especially in communication networks like the internet. The size of these graphs makes it very hard or even impossible to store set of edges in the main memory. Thus, random access to the edges can't be realized, which makes most o ine algorithms unusable. This essay investigates e cient algorithms that read the edges only in a xed sequen...
متن کاملThe semi-streaming model for graph problems
This report presents a relatively new approach in modelling graph problems, called the semi-streaming model. Many of the current computational problems that people face involve huge graphs that cannot be stored in memory. This model is suitable for such type of problems. The main idea is to traverse the set of edges in constant or logarithmic (in the terms of n, the number of vertices) number o...
متن کاملGraph Sparsification in the Semi-streaming Model
Analyzing massive data sets has been one of the key motivations for studying streaming algorithms. In recent years, there has been significant progress in analysing distributions in a streaming setting, but the progress on graph problems has been limited. A main reason for this has been the existence of linear space lower bounds for even simple problems such as determining the connectedness of ...
متن کاملSparsification Algorithm for Cut Problems on Semi-streaming Model
The emergence of social networks and other interaction networks have brought to fore the questions of processing massive graphs. The (semi) streaming model, where we assume that the space is (near) linear in the number of vertices (but not necessarily the edges) is an useful and efficient model for processing large graphs. In many of these graphs the numbers of vertices are significantly less t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.09.013